#include<bits/stdc++.h>
using namespace std;
const int MAXN=100011;
int n,r[MAXN];
int out[MAXN];
bool flag;
int main(){
	
	memset(out,0,sizeof(out));
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&r[i]);
	}
	sort(r+1,r+n+1);
	//for(int i=1;i<=n;i++)printf("%d ",r[i]);
	int x=n;
	for(int i=1;i<=n;i++){
		flag=false;
		for(int j=i+1;j<=n;j++){
			if(r[i]<r[j] && !out[j]){
				out[j]=1;
				x--;
				flag=true;
				break;
			}
		}
		if(flag)continue;
	}
	printf("%d",x);
    return 0;
}
